首页> 外文OA文献 >The largest strongly connected component in Wakeley et al's cyclical pedigree model
【2h】

The largest strongly connected component in Wakeley et al's cyclical pedigree model

机译:Wakeley等人周期性中最强的连通分量   谱系模型

摘要

We establish a link between Wakeley et al's (2012) cyclical pedigree modelfrom population genetics and a randomized directed configuration model (DCM)considered by Cooper and Frieze (2004). We then exploit this link incombination with asymptotic results for the in-degree distribution of thecorresponding DCM to compute the asymptotic size of the largest stronglyconnected component $S^N$ (where $N$ is the population size) of the DCM resp.the pedigree. The size of the giant component can be characterized explicitly(amounting to approximately $80 \%$ of the total populations size) and thuscontributes to a reduced `pedigree effective population size'. In addition, thesecond largest strongly connected component is only of size $O(\log N)$.Moreover, we describe the size and structure of the `domain of attraction' of$S^N$. In particular, we show that with high probability for any individual theshortest ancestral line reaches $S^N$ after $O(\log \log N)$ generations, whilealmost all other ancestral lines take at most $O(\log N)$ generations.
机译:我们在Wakeley等人(2012)的周期性谱系模型中建立了联系,该模型由种群遗传学与Cooper和Frieze(2004)考虑的随机有向配置模型(DCM)之间建立了联系。然后,我们将此链接与渐近结果结合起来以用于相应DCM的度内分布,以计算DCM响应中最大的强连通分量$ S ^ N $的渐近大小(其中$ N $是总体大小)。 。可以明确地描述巨人部分的大小(约占总人口大小的80%),从而有助于减少“家谱有效人口大小”。另外,第二大的强连接组件的大小仅为$ O(\ log N)$。此外,我们还描述了$ S ^ N $的“吸引域”的大小和结构。特别是,我们显示出,对于任何个体,最短的祖先线很有可能在$ O(\ log \ log N)$世代之后达到$ S ^ N $,而几乎所有其他祖先线最多都需要$ O(\ log N)$几代人。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号